A dynamic model of ground water restoration with accelerator constraint
نویسندگان
چکیده
منابع مشابه
Workshop on Monitoring Oxidation-Reduction Processes for Ground-water Restoration
The preparation of this report has been funded wholly by the U.S. Environmental Protection Agency's Office of Research and Development. The views expressed in this Workshop Summary are those of the individual authors and do not necessarily reflect the views and policies of the U.S. Environmental Protection Agency (EPA). This document has been reviewed in accordance with EPA's peer and administr...
متن کاملA Markovian Model for Dynamic Constraint Processing
Dynamic constraint satisfaction is a useful tool for representing and solving sequential decision problems with complete knowledge in dynamic world. We propose an extension of the dynamic constraint satisfaction framework so as to represent stochastic events in sequential decision making. The basis of this extension consists in modeling evolution of the dynamic constraint satisfaction problem b...
متن کاملinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
Signal restoration with controlled piecewise monotonicity constraint
A signal restoration problem can be formulated as a leastsquares inversion subject to a constraint that the signal has no more than k piecewise monotonic segments. We refer to the associated constraint as controlled piecewise monotonicity or CPM. We show that this constraint alone is powerful enough to stabilize an ill-posed inversion and enables us to incorporate the knowledge about the wavefo...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 1995
ISSN: 0307-904X
DOI: 10.1016/0307-904x(94)00017-z